Turán Numbers of Complete 3-Uniform Berge-Hypergraphs
نویسندگان
چکیده
منابع مشابه
Turán numbers for Berge - hypergraphs and related 1 extremal problems
4 Let F be a graph. We say that a hypergraph H is a Berge-F if there is a bijection 5 f : E(F )→ E(H) such that e ⊆ f(e) for every e ∈ E(F ). Note that Berge-F actually 6 denotes a class of hypergraphs. The maximum number of edges in an n-vertex r-graph 7 with no subhypergraph isomorphic to any Berge-F is denoted exr(n,Berge-F ). In this 8 paper we establish new upper and lower bounds on exr(n,...
متن کاملDecompositions of complete uniform hypergraphs into Hamilton Berge cycles
In 1973 Bermond, Germa, Heydemann and Sotteau conjectured that if n divides ( n k ) , then the complete k-uniform hypergraph on n vertices has a decomposition into Hamilton Berge cycles. Here a Berge cycle consists of an alternating sequence v1, e1, v2, . . . , vn, en of distinct vertices vi and distinct edges ei so that each ei contains vi and vi+1. So the divisibility condition is clearly nec...
متن کاملMonochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
We conjecture that for any fixed r and sufficiently large n, there is a monochromatic Hamiltonian Bergecycle in every (r − 1)-coloring of the edges of K n , the complete r-uniform hypergraph on n vertices. We prove the conjecture for r = 3, n 5 and its asymptotic version for r = 4. For general r we prove weaker forms of the conjecture: there is a Hamiltonian Berge-cycle in (r−1)/2 -colorings of...
متن کاملTurán Numbers for 3-Uniform Linear Paths of Length 3
In this paper we confirm a special, remaining case of a conjecture of Füredi, Jiang, and Seiver, and determine an exact formula for the Turán number ex3(n;P 3 3 ) of the 3-uniform linear path P 3 3 of length 3, valid for all n. It coincides with the analogous formula for the 3-uniform triangle C3 3 , obtained earlier by Frankl and Füredi for n > 75 and Csákány and Kahn for all n. In view of thi...
متن کاملHamilton decompositions of complete 3-uniform hypergraphs
A k−uniform hypergraphH is a pair (V, ε), where V = {v1, v2, . . . , vn} is a set of n vertices and ε is a family of k-subset of V called hyperedges. A cycle of length l of H is a sequence of the form (v1, e1, v2, e2, . . . , vl, el, v1), where v1, v2, . . . , vl are distinct vertices, and e1, e2, . . . , el are k-edges of H and vi, vi+1 ∈ ei, 1 ≤ i ≤ l, where addition on the subscripts is modu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2018
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-018-1900-1